package org.cllib.ds;

import java.util.Comparator;


public class AvlTree {
	class AvlNode extends Node{
		int bf;

		public int getBf() {
			return bf;
		}

		public void setBf(int bf) {
			this.bf = bf;
		}
		
	}
	
	AvlNode root;
	
	Comparator c;

	int count;
	public AvlTree(Comparator c) {
		super();
		this.c = c;
	}
	
	public Node insert(Object o){
		return null;
	}
	
	public Node remove(Object o){
		return null;
	}
	
	public Node find(Object o){
		return null;
	}
	
	public int size(){
		return count;
	}
	
	public void clear(){
		root = null;
		count = 0;
	}
	
	public boolean isEmpty(){
		return root == null;
	}
	
	public Object extract(){
		return null;
	}
}
